The Optimal Path - Matching
نویسندگان
چکیده
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems--polynomial-time solvability, rain-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and a polynomial-time algorithm to compute the rank of a certain matrix of indeterminates.
منابع مشابه
مسیر بهینه استخراج از مخازن نفتی با وجود بکارگیری چارچوب قراردادی بیع متقابل (مطالعه موردی یکی از میادین نفتی در حال بهره برداری ایران در خلیج فارس)
The subject of this article is determining the oil optimal production path in one of the Iranian oil and gas brown field in Persian gulf, while the development of the field performed under the buyback contractual framework. In this research we have optimized a dynamic equation using numerically Bellman equation in Matlab program .We have considered different and possible oil price projections a...
متن کاملAnalytical Matching of Optimal Damping Characteristics Curve for Vehicle Passive Suspensions
To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...
متن کاملOptimal Matchings and Degree-Constrained Subgraphs
In this paper the term graph means a finite unoriented linear graph. The same symbol will be used for a graph and its edge-set. The degree d(v, G) of a vertex v in a graph G is simply the number of edges of G which are incident on v, with loops (edges from v to v) counted twice_ The term strict graph will be used for a graph whic h is loopless and contains at most one edge joining any pair of d...
متن کاملAn Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments is built. Establishing correspondence is then reduced to a problem of searching for the optimal path that maximizes a similarity measure. The optimal path is found efficiently without the adverse effects of combinatori...
متن کاملOn the Method of Monitoring and Optimal Control of RF-Plasma
Abstract – A new strategy of reaching efficient matched conditions at the maximum speed in RF power delivery systems for plasma processes is proposed and analyzed. Presented method incorporates unique properties of high speed, automatic discrete matching networks, allowing creation of shortest trajectories and bypassing inhibited states of network parameters. The special matching network model ...
متن کاملMatching, matroids, and extensions
Perhaps the two most fundamental well-solved models in combinatorial optimization are the optimal matching problem and the optimal matroid intersection problem. We review the basic results for both, and describe some more recent advances. Then we discuss extensions of these models, in particular, two recent ones—jump systems and path-matchings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997